The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A genetic algorithm (GA) is used to evolve two and one dimensional cellular automata (CA) to perform a non-trivial collective behavior task. Using as fitness function the average area in the iterative map, the GA is able to discover several rules with the desired behavior. In d = 2 we study the scaling of the attractor versus lattice size and noise. In d = 1, using the tools of the computational mechanics,...
In this paper we study the evolution of asynchronous automata for the density task. We compare our results with those obtained for synchronous automata and we describe the influence of various asynchronous update policies on the computational strategy. We also investigate how synchronous and asynchronous cellular automata behave under noisy conditions and show that asynchronous ones are more fault-tolerant.
This paper reports a high speed, low cost pattern classifier based on the sparse network of Cellular Automata. High quality of classification of patterns with or without noise has been demonstrated through theoretical analysis supported with extensive experimental results.
An efficient mapping scheme is proposed for embedding any one-dimensional firing squad synchronization algorithm onto 2-D arrays, and some new 2-D synchronization algorithms based on the mapping scheme are presented. The proposed mapping scheme can be readily applied to the design of synchronization algorithms with fault tolerance, algorithms operating on multi-dimensional cellular arrays, and for...
We present the behavior of simple subshifts generated by 1D Elementary CA (ECA) with respect to some components of chaoticity as transitivity, topological mixing and strong transitivity. A classification of subshifts generated by ECA with respect to transitivity is given. In literature one can find several notions of topological transitivity. We discuss two types of transitivity for discrete time...
We make a stochastic analysis of both deterministic and stochastic cellular automata. The theory uses a mesoscopic view, i.e. it works with probabilities instead of individual configurations used in micro-simulations. We make an exact analysis by using the theory of Markov processes. This can be done for small problems only. For larger problems we approximate the distribution by products of marginal...
The Ising-like phase transition is considered in probabilistic cellular automata (CA). The nonequilibrium CA with Toom rule are compared to standard equilibrium lattice systems to verify influence of synchronous vs asynchronous updating. It was observed by Marcq et al. [Phys.Rev.E 55(1997) 2606] that the mode of updating separates systems of coupled map lattices into two distinct universality classes...
We present the design of an interactive self-replicating loop, wherein the user can physically induce the loop’s creation and then control its replication and destruction. After introducing the Bio Wall, a reconfigurable electronic wall for bio-inspired applications, we describe the design of our novel loop and delineate its hardware implementation in the wall.
An experimental method is developed to evaluate the possibility of spontaneous emergence of self-reproducing patterns from a quasi-random configuration. In order to achieve viability to the emerging patterns and to their components a robust transition table is designed. Genetic reproduction is compared with self-inspection based reproduction in order to conclude that the latter is better adapted to...
This paper describes the peculiar behavior observed in a class of cellular automata that we have defined as dissipative, i.e., cellular automata that are open and makes it possible for the environment to influence their evolution. Peculiar in the dynamic evolution of this class of cellular automata is that stable macro-level spatial structures emerge from local interactions among cells, a behavior...
This paper presents the formal description of the Multilayered Multi-Agent Situated System (MMASS) which can be seen as a generalization of cellular spaces since it relaxes some constraints on uniformity, locality and closure. MMASS allows the description, representation and simulation of complex systems that explicitly require to consider spatial features. Different forms of interaction are possible...
The topology of Cellular Automata (CA) is that of regular graphs with high clustering coefficients and long characteristic path lengths. The introduction of some long range connections modifies the topology, and it may give rise to small world networks, with high clustering and short path lengths, modifying also the system dynamical properties (attractors, basins of attraction, transient duration)...
In this paper we present a Path-Planning Algorithm for a non-holonomic mobile robot. The robot we considered has to move using smoothed trajectories, without stopping and turning in place, and with a minimum steering radius. We have studied an algorithm based on a directional (anisotropic) propagation of attracting potential values on a Multilayered Cellular Automata model. The algorithm finds all...
Two models of spatially extended population dynamics are investigated. Model A describes a lattice model of evolution of a predator -prey system. We compare four different strategies involving the problems of food resources, existence of cover against predators and birth. Properties of the steady states reached by the predator-prey system are analyzed. Model B concerns an individual-based model of...
Modeling the dynamics of vegetable populations is an extremely challenging problem. The evolution of a vegetable population, that is, of all the weeds, plants and trees that grow in a given area, is mainly influenced by the resources available on the territory (i.e. sunlight, water, substances present in the soil), and how the single individuals compete for them. Traditional models for this case study...
Today most german rivers are flow regulated by dams. They form a barrier for migrating fish species like salmon and are one cause for sustainable disturbances of the ecosystem even to extinction of several fish species. Our question is how to distribute financial resources to improve fish passage systems to obtain a maximal effect. We present a concept to model up- and downstream fish migration with...
Some ant species are known to gather and sort corpses in an auto-organized way. In this contribution, we propose a new cellular ant colony algorithm for sorting and clustering. This algorithm mimics the behavior of real ants. The cellular automata nature of our algorithm implies a straightforward parallelization. The rule consists of a pick-up, a deposition and a diffusion. Our probabilistic pick-up...
We propose to study the complex motion of a crowd with a mesoscopic model inspired by the lattice gas method. The main idea of the model is to relax the exclusion principle by which individuals are not allowed to physically occupy the same location. The dynamics is a simple collision-propagation scheme where the collision term contains the rules which describe the motion of every single individual...
Pedestrian dynamics exhibits a variety of fascinating and surprising collective phenomena (lane formation, flow oscillations at doors etc.). A 2-dimensional cellular automaton model is presented which is able to reproduce these effects. Inspired by the principles of chemotaxis the interactions between the pedestrians are mediated by a so-called floor field. This field has a similar effect as the chemical...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.